Analysis of Serial Turbo Codes over Abelian Groups for Symmetric Channels

نویسندگان

  • Federica Garin
  • Fabio Fagnani
چکیده

In this paper we study serial turbo interconnections of Abelian group codes to be used on symmetric channels. Particular attention is devoted to AWGN channel with input restricted to m-PSK constellation with corresponding group structure Zm. We establish the exact asymptotic decay of the average symbol and word error probabilities when the interleaver length goes to infinity (interleaver gain). Moreover, we give a detailed characterization of the distance parameter characterizing the behavior for the signal-to-noise ratio going to infinity (effective free distance). Some of our results are new also in the binary context; in particular, the lower bound to the error probability decay.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The capacity of Abelian group codes over symmetric channels

In this paper the capacity achievable by Abelian group codes when employed over symmetric channels is determined. For certain important examples, like the AWGN channel with m-PSK modulation, it follows that this capacity coincides with the corresponding Shannon capacity of these channels. In other words using Abelian group codes in this case there is no loss of capacity (as it happens for binar...

متن کامل

Improved Low-Density Parity-Check Codes Using Irregular Graphs and Belief Propagation

We construct new families of error-correcting codes based on Gallager’s low-density parity-check codes, which we call irregular codes. When decoded using belief propagation, our codes can correct more errors than previously known low-density parity-check codes. For example, for rate 1/4 codes on 16,000 bits over a binary symmetric channel, previous low-density parity-check codes can correct up ...

متن کامل

Improved low-density parity-check codes using irregular graphs

We construct new families of error-correcting codes based on Gallager’s low-density parity-check codes. We improve on Gallager’s results by introducing irregular parity-check matrices and a new rigorous analysis of hard-decision decoding of these codes. We also provide efficient methods for finding good irregular structures for such decoding algorithms. Our rigorous analysis based on martingale...

متن کامل

Performance of Turbo Codes over Magnetic Recording Channels

| We study the performance of turbo codes for magnetic recording channels using realistic channel models. Our main objective is to provide a benchmark for the future studies on the subject. We examine a variety of schemes including the use of parallel concatenated turbo codes with and without turbo equalization and convolutional codes with an interleaver (can be regarded as a serial concatenati...

متن کامل

Designing Nonlinear Turbo Codes with a Target Ones Density

Certain binary asymmetric channels, such as Zchannels in which one of the two crossover probabilities is zero, demand optimal ones densities different from 50%. Some broadcast channels, such as broadcast binary symmetric channels (BBSC) where each component channel is a binary symmetric channel, also require a non-uniform input distribution due to the superposition coding scheme, which is known...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2008